Successive eigenvalue relaxation: a new method for the generalized eigenvalue problem and convergence estimates
نویسندگان
چکیده
منابع مشابه
Successive eigenvalue relaxation: a new method for the generalized eigenvalue problem and convergence estimates
The Eprints service at the University of Westminster aims to make the research output of the University available to a wider audience. Copyright and Moral Rights remain with the authors and/or copyright owners. Users are permitted to download and/or print one copy for non-commercial private study or research. Further distribution and any use of material from within this archive for profit-makin...
متن کاملA New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملRate of convergence estimates for the spectral approximation of a generalized eigenvalue problem
Carlos Conca1, Mario Durán2, Jacques Rappaz3 1 Departamento de Ingenierı́a Matemática, Facultad de Ciencias Fı́sicas y Matemáticas, Universidad de Chile, Casilla 170/3 – Correo 3, Santiago, Chile 2 Facultad de Matemáticas, Pontificia Universidad Católica de Chile, Casilla 306, Santiago 22, Chile Centre de Mathématiques Appliquées, Ecole Polytechnique, F-91128 Palaiseau, France 3 Département de Ma...
متن کاملThe Jacobi-Davidson Method for Eigenvalue and Generalized Eigenvalue Problems
We consider variants of Davidson's method for the iterative computation of one or more eigenvalues and their corresponding eigenvectors of an n n matrix A. The original Davidson method 3], for real normal matrices A, may be viewed as an accelerated Gauss-Jacobi method, and the success of the method seems to depend quite heavily on diagonal dominance of A 3, 4, 17]. In the hope to enlarge the sc...
متن کاملA new algorithm for the generalized eigenvalue problem
The problem of finding the generalized eigenvalues and eigenvectors of a pair of real symmetric matrices A and B, with B > 0, can be viewed as a smooth optimization problem on a smooth manifold. We present a cost function approach to the generalized eigenvalue problem which is posed on the product of the n-sphere and Euclidian space R. The critical point set of this cost function is studied. An...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
سال: 2001
ISSN: 1364-5021,1471-2946
DOI: 10.1098/rspa.2000.0674